<HTML><HEAD><TITLE>The ECLiPSe Libraries</TITLE></HEAD><BODY>[ <A HREF="../index.html">Reference Manual</A> | <A HREF="../fullindex.html">Alphabetic Index</A> ]
<H1>The ECLiPSe Libraries</H1><DL>
<DT><A HREF="anti_unify/index.html"><STRONG>anti_unify</STRONG></A></DT>
<DD>Computes the most specific generalization of two terms</DD>
<DT><A HREF="apply/index.html"><STRONG>apply</STRONG></A></DT>
<DD>The apply/2 higher-order predicate</DD>
<DT><A HREF="apply_macros/index.html"><STRONG>apply_macros</STRONG></A></DT>
<DD>Utilities to apply a predicate to all elements of a list resp. all subterms of a term</DD>
<DT><A HREF="asm/index.html"><STRONG>asm</STRONG></A></DT>
<DD>Assemble and disassemble predicates</DD>
<DT><A HREF="atts/index.html"><STRONG>atts</STRONG></A></DT>
<DD>Variable attributes compatible with SICStus v3</DD>
<DT><A HREF="bfs/index.html"><STRONG>bfs</STRONG></A></DT>
<DD>Best-first search library</DD>
<DT><A HREF="branch_and_bound/index.html"><STRONG>branch_and_bound</STRONG></A></DT>
<DD>Generic branch-and-bound primitives</DD>
<DT><A HREF="calendar/index.html"><STRONG>calendar</STRONG></A></DT>
<DD>Routines for calendar computations, based on modified julian dates (MJD).</DD>
<DT><A HREF="cgi/index.html"><STRONG>cgi</STRONG></A></DT>
<DD>Some utilities for writing cgi scripts with ECLiPSe</DD>
<DT><A HREF="changeset/index.html"><STRONG>changeset</STRONG></A></DT>
<DD>Compute sets of modified variables</DD>
<DT><A HREF="chr/index.html"><STRONG>chr</STRONG></A></DT>
<DD>Constraint Handling Rules Library - obsolescent, use library(ech) instead</DD>
<DT><A HREF="cio/index.html"><STRONG>cio</STRONG></A></DT>
<DD>Predicates for C-Prolog style I/O (see/tell family)</DD>
<DT><A HREF="colgen/index.html"><STRONG>colgen</STRONG></A></DT>
<DD>Column generation library</DD>
<DT><A HREF="config_opts/index.html"><STRONG>config_opts</STRONG></A></DT>
<DD>Library for managing configuration options for libraries and applications</DD>
<DT><A HREF="conjunto/index.html"><STRONG>conjunto</STRONG></A></DT>
<DD>Finite Set Constraints Library - obsolescent, use library(fd_sets) instead</DD>
<DT><A HREF="conjunto_fd_sets/index.html"><STRONG>conjunto_fd_sets</STRONG></A></DT>
<DD>lib(conjunto) compatibility wrapper for lib(fd_sets)</DD>
<DT><A HREF="constraint_pools/index.html"><STRONG>constraint_pools</STRONG></A></DT>
<DD>Support for the creation of constraint pools</DD>
<DT><A HREF="coverage/index.html"><STRONG>coverage</STRONG></A></DT>
<DD>Tool for obtaining code coverage information</DD>
<DT><A HREF="cprolog/index.html"><STRONG>cprolog</STRONG></A></DT>
<DD>C-Prolog compatibility package</DD>
<DT><A HREF="cumulative/index.html"><STRONG>cumulative</STRONG></A></DT>
<DD>Cumulative scheduling constraint library for FD</DD>
<DT><A HREF="daVinci/index.html"><STRONG>daVinci</STRONG></A></DT>
<DD>This library provides a simple interface to the daVinci graph drawing tool</DD>
<DT><A HREF="dbi/index.html"><STRONG>dbi</STRONG></A></DT>
<DD>Interface to MySQL databases</DD>
<DT><A HREF="document/index.html"><STRONG>document</STRONG></A></DT>
<DD>Tools for generating documentation from ECLiPSe sources</DD>
<DT><A HREF="ech/index.html"><STRONG>ech</STRONG></A></DT>
<DD>Extended constraint handling rules library</DD>
<DT><A HREF="edge_finder/index.html"><STRONG>edge_finder</STRONG></A></DT>
<DD>Quadratic edge-finder algorithm for disjunctive and cumulative constraints for FD</DD>
<DT><A HREF="edge_finder3/index.html"><STRONG>edge_finder3</STRONG></A></DT>
<DD>Cubic edge-finder algorithm for disjunctive and cumulative constraints for FD</DD>
<DT><A HREF="eplex/index.html"><STRONG>eplex</STRONG></A></DT>
<DD>Interface to external Simplex or MIP solvers</DD>
<DT><A HREF="eplex_cplex/index.html"><STRONG>eplex_cplex</STRONG></A></DT>
<DD>Load lib(eplex) with the CPLEX solver</DD>
<DT><A HREF="eplex_osi/index.html"><STRONG>eplex_osi</STRONG></A></DT>
<DD>Load lib(eplex) with COIN-OR's OSI with a default solver</DD>
<DT><A HREF="eplex_osi_clpcbc/index.html"><STRONG>eplex_osi_clpcbc</STRONG></A></DT>
<DD>Load lib(eplex) with COIN-OR's CLP (linear) with CBC (mixed integer) via OSI's OSIClpSolverInterface.</DD>
<DT><A HREF="eplex_osi_symclp/index.html"><STRONG>eplex_osi_symclp</STRONG></A></DT>
<DD>Load lib(eplex) with COIN-OR's SYMPHONY (mixed integer) with CLP (linear) via OSI's OSISymSolverIterface.</DD>
<DT><A HREF="eplex_xpress/index.html"><STRONG>eplex_xpress</STRONG></A></DT>
<DD>Load lib(eplex) with the XPRESS-MP solver</DD>
<DT><A HREF="fcompile/index.html"><STRONG>fcompile</STRONG></A></DT>
<DD>ECLiPSe III compiler - backward compatibility</DD>
<DT><A HREF="fd/index.html"><STRONG>fd</STRONG></A></DT>
<DD>Finite domain library</DD>
<DT><A HREF="fd_global/index.html"><STRONG>fd_global</STRONG></A></DT>
<DD>Various global constraints over lists of FD variables</DD>
<DT><A HREF="fd_sbds/index.html"><STRONG>fd_sbds</STRONG></A></DT>
<DD>Symmetry Breaking During Search (SBDS)</DD>
<DT><A HREF="fd_search/index.html"><STRONG>fd_search</STRONG></A></DT>
<DD>This library contains a generic search routine which 
implements a number of partial search methods (complete, credit, lds, bbs, dbs)</DD>
<DT><A HREF="fd_sets/index.html"><STRONG>fd_sets</STRONG></A></DT>
<DD>Solver over sets of integers (cooperates with lib(fd))</DD>
<DT><A HREF="flexlm/index.html"><STRONG>flexlm</STRONG></A></DT>
<DD>Interface to Flexlm licence manager</DD>
<DT><A HREF="foreign/index.html"><STRONG>foreign</STRONG></A></DT>
<DD>Simple foreign interface like SICStus or Quintus</DD>
<DT><A HREF="fromonto/index.html"><STRONG>fromonto</STRONG></A></DT>
<DD>Redirect input and output streams in a convenient way</DD>
<DT><A HREF="gap/index.html"><STRONG>gap</STRONG></A></DT>
<DD>Library for interfacing with the GAP computational algebra system</DD>
<DT><A HREF="gnuplot/index.html"><STRONG>gnuplot</STRONG></A></DT>
<DD>Interface to the function and data plotting program - gnuplot</DD>
<DT><A HREF="graph_algorithms/index.html"><STRONG>graph_algorithms</STRONG></A></DT>
<DD>Collection of graph algorithms</DD>
<DT><A HREF="graphviz/index.html"><STRONG>graphviz</STRONG></A></DT>
<DD>Interface to Graphviz Graph Drawing Programs from AT&T</DD>
<DT><A HREF="hash/index.html"><STRONG>hash</STRONG></A></DT>
<DD>Hash table library</DD>
<DT><A HREF="heaps/index.html"><STRONG>heaps</STRONG></A></DT>
<DD>Implement heaps in Prolog</DD>
<DT><A HREF="http/index.html"><STRONG>http</STRONG></A></DT>
<DD>HTTP library</DD>
<DT><A HREF="http_client/index.html"><STRONG>http_client</STRONG></A></DT>
<DD>HTTP client library</DD>
<DT><A HREF="http_server/index.html"><STRONG>http_server</STRONG></A></DT>
<DD>HTTP server library</DD>
<DT><A HREF="ic/index.html"><STRONG>ic</STRONG></A></DT>
<DD>Hybrid integer/real interval arithmetic constraint solver</DD>
<DT><A HREF="ic_cumulative/index.html"><STRONG>ic_cumulative</STRONG></A></DT>
<DD>Cumulative scheduling constraint library for IC</DD>
<DT><A HREF="ic_edge_finder/index.html"><STRONG>ic_edge_finder</STRONG></A></DT>
<DD>Quadratic edge-finder algorithm for disjunctive and cumulative constraints for IC</DD>
<DT><A HREF="ic_edge_finder3/index.html"><STRONG>ic_edge_finder3</STRONG></A></DT>
<DD>Cubic edge-finder algorithm for disjunctive and
cumulative constraints for IC</DD>
<DT><A HREF="ic_gap_sbdd/index.html"><STRONG>ic_gap_sbdd</STRONG></A></DT>
<DD>GAP-based Symmetry Breaking via Dominance Detection (SBDD)</DD>
<DT><A HREF="ic_gap_sbds/index.html"><STRONG>ic_gap_sbds</STRONG></A></DT>
<DD>GAP-based Symmetry Breaking During Search (SBDS)</DD>
<DT><A HREF="ic_global/index.html"><STRONG>ic_global</STRONG></A></DT>
<DD>Various global constraints over lists of IC variables</DD>
<DT><A HREF="ic_hybrid_sets/index.html"><STRONG>ic_hybrid_sets</STRONG></A></DT>
<DD>Solver over sets of integers (lex bounds, cooperates with lib(ic))</DD>
<DT><A HREF="ic_kernel/index.html"><STRONG>ic_kernel</STRONG></A></DT>
<DD>Low-level interface to the common kernel of the IC solver</DD>
<DT><A HREF="ic_make_overlap_bivs/index.html"><STRONG>ic_make_overlap_bivs</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="ic_probe/index.html"><STRONG>ic_probe</STRONG></A></DT>
<DD>Probing</DD>
<DT><A HREF="ic_probe_search/index.html"><STRONG>ic_probe_search</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="ic_probe_support/index.html"><STRONG>ic_probe_support</STRONG></A></DT>
<DD>Probe Support Library</DD>
<DT><A HREF="ic_probing_for_scheduling/index.html"><STRONG>ic_probing_for_scheduling</STRONG></A></DT>
<DD>Probing for Scheduling</DD>
<DT><A HREF="ic_sbds/index.html"><STRONG>ic_sbds</STRONG></A></DT>
<DD>Symmetry Breaking During Search (SBDS)</DD>
<DT><A HREF="ic_sets/index.html"><STRONG>ic_sets</STRONG></A></DT>
<DD>Solver over sets of integers (cooperates with lib(ic))</DD>
<DT><A HREF="ic_symbolic/index.html"><STRONG>ic_symbolic</STRONG></A></DT>
<DD>Solver for constraints over ordered symbolic domains</DD>
<DT><A HREF="instprofile/index.html"><STRONG>instprofile</STRONG></A></DT>
<DD>Instrumentation / sampling based statistics profiler</DD>
<DT><A HREF="instrument/index.html"><STRONG>instrument</STRONG></A></DT>
<DD>Generic tool for code instrumentation</DD>
<DT><A HREF="iso/index.html"><STRONG>iso</STRONG></A></DT>
<DD>ISO Prolog compatibility library</DD>
<DT><A HREF="java_vc/index.html"><STRONG>java_vc</STRONG></A></DT>
<DD>Module for the Java Visualisation Client</DD>
<DT><A HREF="linearize/index.html"><STRONG>linearize</STRONG></A></DT>
<DD>Normalizers for arithmetic expressions</DD>
<DT><A HREF="lint/index.html"><STRONG>lint</STRONG></A></DT>
<DD>Heuristic program checker</DD>
<DT><A HREF="lips/index.html"><STRONG>lips</STRONG></A></DT>
<DD>Measure the system's speed using the naive reverse benchmark</DD>
<DT><A HREF="lists/index.html"><STRONG>lists</STRONG></A></DT>
<DD>Predicates for list manipulation</DD>
<DT><A HREF="make_overlap_bivs/index.html"><STRONG>make_overlap_bivs</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="matrix_util/index.html"><STRONG>matrix_util</STRONG></A></DT>
<DD>Predicates to build matrices from lists</DD>
<DT><A HREF="mip/index.html"><STRONG>mip</STRONG></A></DT>
<DD>An example implementing MIP-style branch-and-bound</DD>
<DT><A HREF="mode_analyser/index.html"><STRONG>mode_analyser</STRONG></A></DT>
<DD>Instrumentation based mode analyser</DD>
<DT><A HREF="module_options/index.html"><STRONG>module_options</STRONG></A></DT>
<DD>Utility library to manage options within a library module</DD>
<DT><A HREF="multifile/index.html"><STRONG>multifile</STRONG></A></DT>
<DD>Multifile declaration, for Prolog compatibility</DD>
<DT><A HREF="notify_ports/index.html"><STRONG>notify_ports</STRONG></A></DT>
<DD>One-to-many and many-to-many notification ports</DD>
<DT><A HREF="notinstance/index.html"><STRONG>notinstance</STRONG></A></DT>
<DD>Constraints for structural equality and subsumption</DD>
<DT><A HREF="numbervars/index.html"><STRONG>numbervars</STRONG></A></DT>
<DD>C-Prolog style numbervars predicate</DD>
<DT><A HREF="ordset/index.html"><STRONG>ordset</STRONG></A></DT>
<DD>Ordered set manipulation utilities</DD>
<DT><A HREF="par_util/index.html"><STRONG>par_util</STRONG></A></DT>
<DD>Parallel versions of various predicates</DD>
<DT><A HREF="port_profiler/index.html"><STRONG>port_profiler</STRONG></A></DT>
<DD>Port Counting Profiler</DD>
<DT><A HREF="pretty_print/index.html"><STRONG>pretty_print</STRONG></A></DT>
<DD>Pretty-printing of complex terms</DD>
<DT><A HREF="pretty_printer/index.html"><STRONG>pretty_printer</STRONG></A></DT>
<DD>This library pretty-prints a file in different formats.</DD>
<DT><A HREF="probe/index.html"><STRONG>probe</STRONG></A></DT>
<DD>Probing</DD>
<DT><A HREF="probe_search/index.html"><STRONG>probe_search</STRONG></A></DT>
<DD>Probe Search</DD>
<DT><A HREF="probe_support/index.html"><STRONG>probe_support</STRONG></A></DT>
<DD>Probe Support Library</DD>
<DT><A HREF="probing_for_scheduling/index.html"><STRONG>probing_for_scheduling</STRONG></A></DT>
<DD>Probing for Scheduling</DD>
<DT><A HREF="profile/index.html"><STRONG>profile</STRONG></A></DT>
<DD>Profiling package for ECLiPSe programs</DD>
<DT><A HREF="propia/index.html"><STRONG>propia</STRONG></A></DT>
<DD>The Generalised Propagation Library</DD>
<DT><A HREF="queues/index.html"><STRONG>queues</STRONG></A></DT>
<DD>define queue operations</DD>
<DT><A HREF="quintus/index.html"><STRONG>quintus</STRONG></A></DT>
<DD>Quintus prolog compatibility package</DD>
<DT><A HREF="quintus_util/index.html"><STRONG>quintus_util</STRONG></A></DT>
<DD>No description available</DD>
<DT><A HREF="regex/index.html"><STRONG>regex</STRONG></A></DT>
<DD>Interface to POSIX regular expression handling</DD>
<DT><A HREF="remote_tools/index.html"><STRONG>remote_tools</STRONG></A></DT>
<DD>Allow the Tk development tools to be used remotely</DD>
<DT><A HREF="repair/index.html"><STRONG>repair</STRONG></A></DT>
<DD>Repair library: support for local search via tentative assignments and repair constraints</DD>
<DT><A HREF="repairfd/index.html"><STRONG>repairfd</STRONG></A></DT>
<DD>No description available</DD>
<DT><A HREF="sd/index.html"><STRONG>sd</STRONG></A></DT>
<DD>Simple solver for constraints over unordered symbolic domains</DD>
<DT><A HREF="sepia/index.html"><STRONG>sepia</STRONG></A></DT>
<DD>A number of obsolete SEPIA built-ins</DD>
<DT><A HREF="shadow_cons/index.html"><STRONG>shadow_cons</STRONG></A></DT>
<DD>A library implementing shadow, or 'local', constraint stores</DD>
<DT><A HREF="sicstus/index.html"><STRONG>sicstus</STRONG></A></DT>
<DD>SICStus Prolog Compatibility Package</DD>
<DT><A HREF="sockets/index.html"><STRONG>sockets</STRONG></A></DT>
<DD>Sicstus compatible sockets interface</DD>
<DT><A HREF="source_processor/index.html"><STRONG>source_processor</STRONG></A></DT>
<DD>Tools for processing ECLiPSe sources</DD>
<DT><A HREF="spell/index.html"><STRONG>spell</STRONG></A></DT>
<DD>Predicate name spelling correction</DD>
<DT><A HREF="suspend/index.html"><STRONG>suspend</STRONG></A></DT>
<DD>Lazy-checking versions of arithmetic primitives, and the suspend-attribute</DD>
<DT><A HREF="swi/index.html"><STRONG>swi</STRONG></A></DT>
<DD>SWI-Prolog compatibility package</DD>
<DT><A HREF="sym_expr/index.html"><STRONG>sym_expr</STRONG></A></DT>
<DD>Library for expressing the symmetries of a CSP</DD>
<DT><A HREF="tentative/index.html"><STRONG>tentative</STRONG></A></DT>
<DD>A framework for Local Search based on tentative values</DD>
<DT><A HREF="tentative_constraints/index.html"><STRONG>tentative_constraints</STRONG></A></DT>
<DD>Tentative value implementations for some basic constraints</DD>
<DT><A HREF="test_util/index.html"><STRONG>test_util</STRONG></A></DT>
<DD>Utilities for automated program tests</DD>
<DT><A HREF="time_log/index.html"><STRONG>time_log</STRONG></A></DT>
<DD>Module for logging and collating test times</DD>
<DT><A HREF="timeout/index.html"><STRONG>timeout</STRONG></A></DT>
<DD>Impose time limit for goals</DD>
<DT><A HREF="toplevel/index.html"><STRONG>toplevel</STRONG></A></DT>
<DD>Interactive ECLiPSe toplevel interpreter</DD>
<DT><A HREF="tty_vc/index.html"><STRONG>tty_vc</STRONG></A></DT>
<DD>Simple TTY visualisation client</DD>
<DT><A HREF="util/index.html"><STRONG>util</STRONG></A></DT>
<DD>Various utility predicates for program development</DD>
<DT><A HREF="var_name/index.html"><STRONG>var_name</STRONG></A></DT>
<DD>Allows variables to be given stable and unique names.</DD>
<DT><A HREF="vc_support/index.html"><STRONG>vc_support</STRONG></A></DT>
<DD>Library to support implementation of visualisation clients</DD>
<DT><A HREF="viewable/index.html"><STRONG>viewable</STRONG></A></DT>
<DD>Module for the management of viewables: arrays for visualisation</DD>
<DT><A HREF="xref/index.html"><STRONG>xref</STRONG></A></DT>
<DD>Cross-referencing tool</DD>
</DL>
<HR>Generated 2009-05-27 01:25
</BODY></HTML>
